Flexible Dispatch of Disjunctive Plans
نویسندگان
چکیده
Many systems are designed to perform both planning and execution: they include a plan deliberation component to produce plans that are then dispatched to an execution component, or executive, which is responsible for the performance of the actions in the plan. When the plans have temporal constraints, dispatch may be non-trivial, and the system may include a distinct dispatcher, which is responsible for ensuring that all temporal constraints are satisfied by the executive. Prior work on dispatch has focused on plans that can be expressed as Simple Temporal Problems (STPs). In this paper, we sketch a dispatch algorithm that is applicable to a much broader set of plans, namely those that can be cast as Disjunctive Temporal Problems (DTPs), and we identify four key properties of the algorithm.
منابع مشابه
Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction
In order for an autonomous agent to successfully complete its mission, the agent must be able to quickly replan on the fly, as unforeseen events arise in the environment. This is enabled through the use of temporally flexible plans, which allow the agent to adapt to execution uncertainties, by not over committing to timing constraints, and through continuous planners, which are able to replan a...
متن کاملAn optimization of disjunctive queries: union-pushdown
Most previous works on query optimization techniques deal with conjunctive queries only because the queries with disjunctive predicates are complex to optimize. Hence, for disjunctive queries, query optimizers based on these techniques generate plans using rather simple methods such as CNFand DNF-based optimization. However, the plans generated by these methods perform extremely poorly for cert...
متن کاملQuery Planning with Disjunctive Sources
We examine the query planning problem in information integration systems in the presence of sources that contain disjunctive information. We show that datalog, the language of choice for representing query plans in information integration systems, is not sufficiently expressive in this case. We prove that disjunctive datalog with inequality is sufficiently expressive, and present a construction...
متن کاملOn the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning
Most existing planners intertwine the refinement of a partial plan with search by pushing the individual refinements of a plan into different search branches. Although this approach reduces the cost of handling partial plans, it also often leads to search space explosion. In this paper, we consider the possibility of handling the refinements of a partial plan together (without splitting them in...
متن کاملFlexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executives have improved this robustness by expanding the types of choices made dynamically, such as selecting alternate methods. However, in methods to date, these additional choices introduce substantial run-time latency. Thi...
متن کامل